Gordon James Tucker

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding minimum Tucker submatrices

A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physical mapping and ancestral genome reconstruction in computational biology on the other hand they represents a class of convex bipartite graphs and are of interest of algorithm graph theory researchers. Tucker gave a forb...

متن کامل

Octahedral Tucker is PPA-Complete

The Octahedral Tucker problem considers an n-dimensional hypergrid of side length two, centered at the origin, triangulated by connecting the origin to all outside vertices (applied recursively on each of the lower dimensional hypergrids passing through their origins at the corresponding reduced dimensions). Each vertex is assigned a color in ±i : i = 1, 2, ..., n computed using a polynomial si...

متن کامل

James

a chair, he was the very picture of dejection. His small head was hanging, an obstreperous tuft of the coarse, sandy hair standing defiantly upright on the crown of it; his complexion was sallow and pasty, and not in any way enhanced by a sparse scattering of tiny yellow freckles, plainly visible at close view; his generous mouth drooped, like his head, the lips pale, but firmly closed. In his ...

متن کامل

2D-TUCKER Is PPAD-Complete

Tucker’s lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1,−1, 2,−2} in an antipodal way (if |z| = 1, then the sum of the colors of z and −z is zero), then there must be an edge for which the sum of the colors of its endpoints is zero. But how hard is it to find such an edge? We show that if the triangulation is exponentially large and the c...

متن کامل

Algorithms for Finding Tucker Patterns

The Consecutive-Ones Property (C1P) in binary matrices is a combinatorial concept with applications in several area, from graph planarity testing to computational biology. Tucker patterns are families of submatrices that characterize non-C1P matrices, and thus represent natural certificates of non-C1P matrices. However, there are very few algorithmic results regarding Tucker patterns. In the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Dental Journal

سال: 2013

ISSN: 0007-0610,1476-5373

DOI: 10.1038/sj.bdj.2013.212